Computability logic

Results: 552



#Item
381Computability theory / Boolean algebra / Functions and mappings / Lambda calculus / Theoretical computer science / Monad / Boolean data type / Function / Conditional / Mathematics / Computing / Mathematical logic

Lists in TEX’s Mouth Alan Jeffrey August 6, 2013 1

Add to Reading List

Source URL: mirror.isoc.org.il

Language: English - Date: 2013-08-06 12:14:00
382Computability theory / Boolean algebra / Functions and mappings / Lambda calculus / Theoretical computer science / Monad / Boolean data type / Function / Conditional / Mathematics / Computing / Mathematical logic

Lists in TEX’s Mouth Alan Jeffrey August 6, 2013 1

Add to Reading List

Source URL: ctan.space-pro.be

Language: English - Date: 2013-08-06 13:14:53
383Computability theory / Boolean algebra / Functions and mappings / Lambda calculus / Theoretical computer science / Monad / Boolean data type / Function / Conditional / Mathematics / Computing / Mathematical logic

Lists in TEX’s Mouth Alan Jeffrey August 6, 2013 1

Add to Reading List

Source URL: distrib-coffee.ipsl.jussieu.fr

Language: English - Date: 2013-08-06 13:14:53
384Computability theory / Boolean algebra / Functions and mappings / Lambda calculus / Theoretical computer science / Monad / Boolean data type / Function / Conditional / Mathematics / Computing / Mathematical logic

Lists in TEX’s Mouth Alan Jeffrey August 6, 2013 1

Add to Reading List

Source URL: mirror.selfnet.de

Language: English - Date: 2013-08-06 13:14:53
385Functions and mappings / Computability theory / Combinatory logic / Lambda calculus / Logic in computer science / Function / Big O notation / Primitive recursive function / Jan Willem Klop / Mathematics / Mathematical analysis / Theoretical computer science

Symbolic Computation for Electronic Publishng Michael P. Barnett Department of Computer and Information Science, Brooklyn College of the City University of New York, Brooklyn, NY[removed]Internet: b a r n e t t e i t s . b

Add to Reading List

Source URL: www.tug.org

Language: English - Date: 2011-10-16 21:02:52
386Computability theory / Functions and mappings / Theory of computation / Function / Computable function / Combinatory logic / Randomized algorithm / Theoretical computer science / Mathematics / Applied mathematics

Deterministic Function Computation with Chemical Reaction Networks∗ Ho-Lin Chen† David Doty‡

Add to Reading List

Source URL: solo.ucsf.edu

Language: English - Date: 2013-08-31 02:02:06
387Functions and mappings / Computability theory / Combinatory logic / Lambda calculus / Logic in computer science / Function / Big O notation / Primitive recursive function / Jan Willem Klop / Mathematics / Mathematical analysis / Theoretical computer science

Symbolic Computation for Electronic Publishng Michael P. Barnett Department of Computer and Information Science, Brooklyn College of the City University of New York, Brooklyn, NY[removed]Internet: b a r n e t t e i t s . b

Add to Reading List

Source URL: tug.org

Language: English - Date: 2011-10-16 21:02:52
388Programming idioms / Mathematical logic / Computability theory / Theoretical computer science / Recursion / Theory of computation / Logo / Subroutine / Control flow / Computer programming / Software engineering / Computing

7 Introduction to Recursion My goal in this chapter is to write a procedure named downup that behaves like this: ? downup "hello

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2003-12-25 23:44:04
389Programming idioms / Theoretical computer science / Mathematical logic / Computability theory / Logo / Recursion / Subroutine / Elf / Elves / Computer programming / Software engineering / Computing

9 How Recursion Works The last two chapters were about how to write recursive procedures. This chapter is about how to believe in recursive procedures, and about understanding the process by which

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2003-12-25 23:45:48
390Theoretical computer science / Functions and mappings / Recursion / Theory of computation / Primitive recursive function / Function / Μ-recursive function / Course-of-values recursion / Computability theory / Mathematics / Mathematical logic

Recursive definitions are familiar in mathematics. For instance, the function f defined by f (0) = 1, f (1) = 1, f (x + 2) = f (x + 1) + f (x), gives the Fibonacci sequence: 1, 1, 2, 3, 5, 8, 13, . . . . (The study of di

Add to Reading List

Source URL: www.ctan.org

Language: English - Date: 2013-12-20 19:14:22
UPDATE